Generating Effective Test Suites for Model Transformations Using Classifying Terms

Generating sample models for testing a model transformation is no easy task. This paper explores the use of classifying terms and stratified sampling for developing richer test cases for model transformations. Classifying terms are used to define the equivalence classes that characterize the relevant subgroups for the test cases. From each equivalence class of object models, several representative models are chosen depending on the required sample size. We compare our results with test suites developed using random sampling, and conclude that by using an ordered and stratified approach the coverage and effectiveness of the test suite can be significantly improved.Universidad de Málaga. Campus de Excelencia Internacional Andalucía Tech

Employing Classifying Terms for Testing Model Transformations

This contribution proposes a new technique for developing test cases for UML and OCL models. The technique is based on an approach that automatically constructs object models for class models enriched by OCL constraints. By guiding the construction process through so-called classifying terms, the built test cases in form of object models are classified into equivalence classes. A classifying term can be an arbitrary OCL term on the class model that calculates for an object model a characteristic value. From each equivalence class of object models with identical characteristic values one representative is chosen. The constructed test cases behave significantly different with regard to the selected classifying term. By building few diverse object models, properties of the UML and OCL model can be explored effectively. The technique is applied for automatically constructing relevant source model test cases for model transformations between a source and target metamodel.Universidad de Málaga. Campus de Excelencia Internacional Andalucía Tech

Integrating UML/OCL Derived Properties into Validation and Verification Processes

Abstract. UML and OCL are rich languages offering a multitude of modeling elements. They provide modelers with simple and effective tools to express and visualize models, but their complex semantics are a great challenge for validation and verification processes, which are often limited by their underlying logic. On the basis of a network topology example model, describing lower physical and logical network levels, we demonstrate applications of derived attributes and associations that help checking network security aspects. This includes finding inconsistencies in an existing network, directing to potential configuration errors and property evaluation, e.g. reachability between components within the network. In addition, a transformation of derived properties into relational logic is presented to enable the use of a modern instance finder for further verification tasks and generation of valid networks configurations

Climate setting in sourcing teams: Developing a measurement scale for team creativity climate

Creative sourcing strategies, designed to extract more value from the supply base, have become a competitive, strategic differentiator. To fuel creativity, companies install sourcing teams that can capitalize on the specialized knowledge and expertise of their employees across the company. This article introduces the concept of a team creativity climate (TCC) - team members' shared perceptions of their joint policies, procedures, and practices with respect to developing creative sourcing strategies – as a means to address the unique challenges associated with a collective, cross-functional approach to develop value-enhancing sourcing strategies. Using a systematic scale development process that validates the proposed concept, the authors confirm its ability to predict sourcing team performance, and suggest some research avenues extending from this concept

User Assistance Characteristics of the USE Model Checking Tool

The Unified Modeling Language (UML) is a widely used general purpose modeling language. Together with the Object Constraint Language (OCL), formal models can be described by defining the structure and behavior with UML and additional OCL constraints. In the development process for formal models, it is important to make sure that these models are (a) correct, i.e. consistent and complete, and (b) testable in the sense that the developer is able to interactively check model properties. The USE tool (UML-based Specification Environment) allows both characteristics to be studied. We demonstrate how the tool supports modelers to analyze, validate and verify UML and OCL models via the use of several graphical means that assist the modeler in interpreting and visualizing formal model descriptions. In particular, we discuss how the so-called USE model validator plugin is integrated into the USE environment in order to allow non domain experts to use it and construct object models that help to verify properties like model consistency

History of the USE Tool 20 Years of UML/OCL Modeling Made in Germany

The UML-based Specification Environment (USE) originated as a modeling tool for validating UML and OCL models but has grown much larger over the years. The first version of USE was released in 1998. Since then, USE has been applied in several projects and had lots of contributors developing it, benefiting from a university environment and open source code basis. Its strong OCL evaluator allows for using it as a platform for other modeling projects but also applications in research projects and teaching have made USE a significant entry in the world of UML/OCL modeling tools. Countless case studies have been performed on the basis of USE. This contribution shows the evolution of USE by summarizing important extensions over the years. Furthermore, noteworthy applications of USE in teaching, research and industry are presented

UML and OCL Transformation Model Analysis: Checking Invariant Independence

Abstract. This paper discusses a case study for showing invariant independence for a transformation model. The study is based on an approach that proposes to analyze UML and OCL models using a solver for relational logic. In the approach, UML and OCL models describe system structures formally with UML class diagrams and OCL class invariants. Test cases in form of object diagrams are constructed and employed for property inspection. With the approach one can prove model properties like model constraint independence for the structural model part. Thus important model properties can be analyzed on the modeling level without the need for implementing the model. All feedback given to the developer is stated in terms of the used modeling language, UML and OCL

Iterative Development of Transformation Models by Using Classifying Terms

Abstract In this paper we propose an iterative process for the correct specication of model transformations, i.e., for developing correct transformation models. This permits checking the correctness of a model transformation specication before any implementation is available. The proposal is based on the use of classifying terms for partitioning the input space and for simplifying the testing process

Synthesising Call Sequences from OCL Operational Contracts

The Unified Modeling Language (UML) is widely used by software engineers in different phases of software development cycle. It allows them to visualise and depict a system into different diagrams. Among these diagrams, UML class diagrams are used to capture the structure of a system including classes, attributes and associations. The set of operation calls defined in a UML class diagram then capture the behaviour of a system. These operation calls typically constrain the inputs and outputs via a set of pre or postconditions (operational contracts) written in Object Constraint Language (OCL). Hence, a sequence of operation calls conforming to pre or postconditions is crucial to analyse, verify and understand the behaviour of a system. In this paper, we propose a new technique for synthesising call sequences from a set of operational contracts. This technique works by reducing a synthesis problem to a satisfiability modulo theories (SMT) problem. The preliminary results show that our technique is capable of synthesising call sequences at a large scale